46 research outputs found

    Lagrangian dual method for solving stochastic linear quadratic optimal control problems with terminal state constraints

    Full text link
    A stochastic linear quadratic (LQ) optimal control problem with a pointwise linear equality constraint on the terminal state is considered. A strong Lagrangian duality theorem is proved under a uniform convexity condition on the cost functional and a surjectivity condition on the linear constraint mapping. Based on the Lagrangian duality, two approaches are proposed to solve the constrained stochastic LQ problem. First, a theoretical method is given to construct the closed-form solution by the strong duality. Second, an iterative algorithm, called augmented Lagrangian method (ALM), is proposed. The strong convergence of the iterative sequence generated by ALM is proved. In addition, some sufficient conditions for the surjectivity of the constraint mapping are obtained

    A prediction-correction ADMM for multistage stochastic variational inequalities

    Full text link
    The multistage stochastic variational inequality is reformulated into a variational inequality with separable structure through introducing a new variable. The prediction-correction ADMM which was originally proposed in [B.-S. He, L.-Z. Liao and M.-J. Qian, J. Comput. Math., 24 (2006), 693--710] for solving deterministic variational inequalities in finite dimensional spaces is adapted to solve the multistage stochastic variational inequality. Weak convergence of the sequence generated by that algorithm is proved under the conditions of monotonicity and Lipschitz continuity. When the sample space is a finite set, the corresponding multistage stochastic variational inequality is defined on a finite dimensional Hilbert space and the strong convergence of the sequence naturally holds true. A numerical example in that case is given to show the efficiency of the algorithm
    corecore